Hierarchical Pipelining of Nested Loops in High-Level Synthesis
نویسندگان
چکیده
منابع مشابه
Software Pipelining of Nested Loops
Software pipelining is a technique to improve the performance of a loop by overlapping the execution of several iterations. The execution of a software-pipelined loop goes through three phases: prolog, kernel, and epilog. Software pipelining works best if most of the time is spent in the kernel phase rather than in the prolog or epilog phases. This can happen only if the trip count of a pipelin...
متن کاملSoftware pipelining of nested loops
This paper presents an approach to software pipelining of nested loops. While several papers have addressed software pipelining of inner loops, little work has been done in the area of extending it to nested loops. This paper solves the problem of nding the minimum iteration initiation interval (in the absence of resource constraints) for each level of a nested loop. The problem is formulated a...
متن کاملSoftware Pipelining for Nested Loops
In this paper, we present a novel framework of software pipelining for nested loops. Under this framework, a periodic scheduling function, called r-periodic schedule, is associated with each operation of the loop body in the entire iteration space. We present a simple problem formulation as well as e cient solutions which gives provable asymptotically time-optimal schedule for nested loops unde...
متن کاملHierarchical Scheduling in High Level Synthesis Using Resource Sharing Across Nested Loops
This paper presents a resource-constrained scheduling algorithm for hierarchical behavioral speciications containing nested loops. The algorithm attempts to share resources across levels, to schedule operations that belong to diierent levels of the nested loop structures in the speciications as well as operations that belong to the same level. We compare the results of scheduling using our algo...
متن کاملOptimal Software Pipelining of Nested Loops
This paper presents an approach to software pipelining of nested loops. While several papers have addressed software pipelining of single (non-nested) loops, little work has been done in the area of applying it to nested loops. This paper solves the problem of nding the minimum iteration initiation interval (in the absence of resource constraints) for each level of a nested loop. The problem is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodica Polytechnica Electrical Engineering and Computer Science
سال: 2014
ISSN: 2064-5260,2064-5279
DOI: 10.3311/ppee.7610